On the Computability of Some Positive-depth Supercuspidal Characters near the Identity

نویسندگان

  • R. CLUCKERS
  • C. CUNNINGHAM
  • J. GORDON
چکیده

This paper is concerned with the values of Harish-Chandra characters of a class of positive-depth, toral, very supercuspidal representations of p-adic symplectic and special orthogonal groups, near the identity element. We declare two representations equivalent if their characters coincide on a specific neighbourhood of the identity (which is larger than the neighbourhood on which the Harish-Chandra local character expansion holds). We construct a parameter space B (that depends on the group and a real number r > 0) for the set of equivalence classes of the representations of minimal depth r satisfying some additional assumptions. This parameter space is essentially a geometric object defined over Q. Given a non-Archimedean local field K with sufficiently large residual characteristic, the part of the character table near the identity element for G(K) that comes from our class of representations is parameterized by the residue-field points of B. The character values themselves can be recovered by specialization from a constructible motivic exponential function, in the terminology of Cluckers and Loeser in a recent paper. The values of such functions are algorithmically computable. It is in this sense that we show that a large part of the character table of the group G(K) is computable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spherical characters: the supercuspidal case

We exhibit a basis for the space of spherical characters of a distinguished supercuspidal representation π of a connected reductive p-adic group, subject to the assumption that π is obtained via induction from a representation of an open compact mod centre subgroup. We derive an integral formula for each spherical character belonging to the the basis. This formula involves integration of a part...

متن کامل

Construction of Tame Supercuspidal Representations

The notion of depth is defined by Moy-Prasad [MP2]. The notion of a generic character will be defined in §9. When G = GLn or G is the multiplicative group of a central division algebra of dimension n with (n, p) = 1, our generic characters are just the generic characters in [My] (where the definition is due to Kutzko). Moreover, in these cases, our construction literally specializes to Howe’s c...

متن کامل

SUPERCUSPIDAL CHARACTERS OF REDUCTIVE p-ADIC GROUPS

We compute the characters of many supercuspidal representations of reductive p-adic groups. Specifically, we deal with representations that arise via Yu’s construction from data satisfying a certain compactness condition. Each character is expressed in terms of a depth-zero character of a smaller group, the (linear) characters appearing in Yu’s construction, Fourier transforms of orbital integr...

متن کامل

Motivic Proof of a Character Formula for Sl(2) Clifton Cunningham and Julia Gordon

We give a motivic proof of a character formula for depth zero supercuspidal representations of p-adic SL(2). We begin by finding the virtual Chow motives for the character values of all depth zero supercuspidal representations of p-adic SL(2), at topologically unipotent elements. Then we find the virtual Chow motives for the values of the Fourier transform of all regular elliptic orbital integr...

متن کامل

Supercuspidal Representations: an Exhaustion Theorem

Let k be a p-adic field of characteristic zero and residue characteristic p. Let G be the group of k-points of a connected reductive group G defined over k. In [38], Yu gives a fairly general construction of supercuspidal representations of G in a certain tame situation. In this paper, subject to some hypotheses on G and k, we prove that all supercuspidal representations arise through his const...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011